Finite State Automata Evolution Using Modular Architecture
نویسندگان
چکیده
منابع مشابه
Image Representation Using Finite State Automata
Image representation using quadtrees is useful in many applications and is well known in computer graphics. It has been shown that we can represent quadtrees asrationallanguages that are recognizable by finite state automata (FSA) [1]. These FSA can use less memory and are more flexible than their corresponding quadtrees. Binary image representation using FSA follows these two main steps: (1) F...
متن کاملUsing Finite State Automata for Sequence Mining
We show how frequently occurring sequential patterns may be found from large datasets by first inducing a finite state automaton model describing the data, and then querying the model.
متن کاملLearning Corpus Patterns Using Finite State Automata
Words get their meaning in context and Harris’s Distributional Hypothesis has been used in computational linguistics in order to identify the relationship between co-occurring words and their senses. In general, the local context contains the necessary information for word sense disambiguation (Stevenson&Wilks 2001). However, the exact extent of the local context varies significantly. To cope w...
متن کاملcient Instruction Scheduling Using Finite State Automata
Modern compilers employ sophisticated instruction scheduling techniques to shorten the number of cycles taken to execute the instruction stream. In addition to correctness, the instruction scheduler must also ensure that hardware resources are not oversubscribed in any cycle. For a contemporary processor implementation with multiple pipelines and complex resource usage restrictions , this is no...
متن کاملResidual Finite State Automata
We introduce a subclass of non deterministic finite automata (NFA) that we call Residual Finite State Automata (RFSA): a RFSA is a NFA all the states of which define residual languages of the language it recognizes. We prove that for every regular language L, there exists a unique RFSA that recognizes L and which has both a minimal number of states and a maximal number of transitions. Moreover,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms & Computational Technology
سال: 2010
ISSN: 1748-3026,1748-3026
DOI: 10.1260/1748-3018.4.4.495